This report which is a continuation of Technical Report No. 65 deals with the transmission of information through a discrete channel disturbed by noise. It considers, in particular, the problem of reducing the equivocation by coding. The behavior of the per-unit equivocation as a function of the channel equivocation is computed in an approximate manner for a number of coding schemes of increasing complexity. The results indicate that the limiting condition of vanishing per-unit equivocation is approached rather slowly with increasing code complexity.